Mathematical Programs for Belief Propagation and Consensus

نویسنده

  • Kwang Ki Kevin Kim
چکیده

This paper develops methods of distributed Bayesian hypothesis tests for fault detection and diagnosis that are based on belief propagation and optimization in graphical models. The main challenges in developing distributed statistical estimation algorithms are i) difficulties in ensuring convergence and consensus for solutions of distributed inference problems, ii) increasing computational costs due to lack of scalability, and iii) communication constraints for networked multi-agent systems. To cope with those challenges, this manuscript considers i) belief propagation and optimization in graphical models of complex distributed systems, ii) decomposition methods of optimization for parallel and iterative computations, and iii) distributed decision-making protocols.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Reweighted Belief Propagation for Distributed Likelihood Fusion Problems

Belief propagation (BP) is a powerful tool to solve distributed inference problems, though it is limited by short cycles in the corresponding factor graph. Such cycles may lead to incorrect solutions or oscillatory behavior. Only for certain types of problems are convergence properties understood. We extend this knowledge by investigating the use of reweighted BP for likelihood consensus proble...

متن کامل

Mathematical structures of loopy belief propagation and cluster variation method

The mathematical structures of loopy belief propagation are reviewed for graphical models in probabilistic information processing in the stand point of cluster variation method. An extension of adaptive TAP approaches is given by introducing a generalized scheme of the cluster variation method. Moreover the practical message update rules in loopy belief propagation are summarized also for quant...

متن کامل

Belief consensus algorithms for fast distributed target tracking in wireless sensor networks

In distributed target tracking for wireless sensor networks, agreement on the target state can be achieved by the construction and maintenance of a communication path, in order to exchange information regarding local likelihood functions. Such an approach lacks robustness to failures and is not easily applicable to ad-hoc networks. To address this, several methods have been proposed that allow ...

متن کامل

Bayes'sche Consensus-Regelung in dezentralen vernetzten Systemen / Bayesian Consensus Control in Decentralized Networked Systems

Der Beitrag befasst sich mit vernetzten dynamischen Multi-Agenten-Systemen (MAS), die Konsens über ihre Zustände bei unsicherer Datenübertragung und Sensorrauschen erreichen sollen. Dazu wird eine Analogie zwischen dem klassischen Consensus-Protokoll und dem Gauß’schen Belief Propagation hergestellt. Das Consensus-Problem wird als stochastischer Prozess modelliert, wodurch Unsicherheiten über d...

متن کامل

Inside-Outside Probability Computation for Belief Propagation

In this paper we prove that the well-known correspondence between the forward-backward algorithm for hidden Markov models (HMMs) and belief propagation (BP) applied to HMMs can be generalized to one between BP for junction trees and the generalized inside-outside probability computation for probabilistic logic programs applied to junction trees.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1501.04538  شماره 

صفحات  -

تاریخ انتشار 2015